/**
 * https://leetcode.cn/problems/climbing-stairs/description/
 * 70. 爬楼梯
 * 简单, 赖德檀 2024.09.09
 * 动态规划
 */
 class Solution {
public:
    int climbStairs(int n) {
        vector<int>dp(100,0);
        dp[1]=1;
        dp[2]=2;
        for(int i=3;i<=n;i++)
        {
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
};